TSTP Solution File: SYN983^1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYN983^1 : TPTP v8.1.0. Released v3.6.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Thu Jul 21 08:30:59 EDT 2022
% Result : Theorem 0.12s 0.39s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of formulae : 39 ( 19 unt; 3 typ; 0 def)
% Number of atoms : 213 ( 57 equ; 0 cnn)
% Maximal formula atoms : 7 ( 5 avg)
% Number of connectives : 98 ( 35 ~; 29 |; 9 &; 22 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $o ).
thf(tp_b,type,
b: $o ).
thf(tp_p,type,
p: $o > $o ).
thf(1,conjecture,
( ( ( p @ a )
& ( p @ b ) )
=> ( p
@ ( a
& b ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(2,negated_conjecture,
( ( ( ( p @ a )
& ( p @ b ) )
=> ( p
@ ( a
& b ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( ( p @ a )
& ( p @ b ) )
=> ( p
@ ( a
& b ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( p @ a )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( p @ b )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( p
@ ( a
& b ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(7,plain,
( ( ~ ( p
@ ( a
& b ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(8,plain,
( ( p @ b )
= $true ),
inference(copy,[status(thm)],[5]) ).
thf(9,plain,
( ( p @ a )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(10,plain,
( ( ~ ( p
@ ( a
& b ) ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(11,plain,
( ( ~ ( p
@ ~ ( ~ a
| ~ b ) ) )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(12,plain,
( ( p
@ ~ ( ~ a
| ~ b ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(13,plain,
( ( ( p
@ ~ ( ~ a
| ~ b ) )
= ( p @ a ) )
= $false ),
inference(res,[status(thm)],[12,9]) ).
thf(14,plain,
( ( ( p
@ ~ ( ~ a
| ~ b ) )
= ( p @ b ) )
= $false ),
inference(res,[status(thm)],[12,8]) ).
thf(15,plain,
( ( ( ~ ( ~ a
| ~ b ) )
= $true )
| ( b = $true ) ),
inference(extuni,[status(esa)],[14]) ).
thf(16,plain,
( ( ( ~ ( ~ a
| ~ b ) )
= $false )
| ( b = $false ) ),
inference(extuni,[status(esa)],[14]) ).
thf(17,plain,
( ( ( ~ ( ~ a
| ~ b ) )
= $true )
| ( a = $true ) ),
inference(extuni,[status(esa)],[13]) ).
thf(19,plain,
( ( ( ~ a
| ~ b )
= $true )
| ( b = $false ) ),
inference(extcnf_not_neg,[status(thm)],[16]) ).
thf(20,plain,
( ( ( ~ a
| ~ b )
= $false )
| ( b = $true ) ),
inference(extcnf_not_pos,[status(thm)],[15]) ).
thf(22,plain,
( ( ( ~ a
| ~ b )
= $false )
| ( a = $true ) ),
inference(extcnf_not_pos,[status(thm)],[17]) ).
thf(23,plain,
( ( ( ~ a )
= $true )
| ( ( ~ b )
= $true )
| ( b = $false ) ),
inference(extcnf_or_pos,[status(thm)],[19]) ).
thf(25,plain,
( ( ( ~ b )
= $false )
| ( b = $true ) ),
inference(extcnf_or_neg,[status(thm)],[20]) ).
thf(27,plain,
( ( ( ~ a )
= $false )
| ( a = $true ) ),
inference(extcnf_or_neg,[status(thm)],[22]) ).
thf(29,plain,
( ( a = $false )
| ( ( ~ b )
= $true )
| ( b = $false ) ),
inference(extcnf_not_pos,[status(thm)],[23]) ).
thf(31,plain,
( ( b = $true )
| ( b = $true ) ),
inference(extcnf_not_neg,[status(thm)],[25]) ).
thf(33,plain,
( ( a = $true )
| ( a = $true ) ),
inference(extcnf_not_neg,[status(thm)],[27]) ).
thf(35,plain,
( ( b = $false )
| ( a = $false )
| ( b = $false ) ),
inference(extcnf_not_pos,[status(thm)],[29]) ).
thf(37,plain,
( ( b = $false )
| ( a = $false ) ),
inference(sim,[status(thm)],[35]) ).
thf(38,plain,
b = $true,
inference(sim,[status(thm)],[31]) ).
thf(40,plain,
a = $true,
inference(sim,[status(thm)],[33]) ).
thf(56,plain,
( ( ( b = b )
= $false )
| ( a = $false ) ),
inference(res,[status(thm)],[38,37]) ).
thf(58,plain,
a = $false,
inference(extuni,[status(esa)],[56]) ).
thf(59,plain,
( ( ( a = a )
= $false )
| ( b = $false ) ),
inference(res,[status(thm)],[40,37]) ).
thf(62,plain,
b = $false,
inference(extuni,[status(esa)],[59]) ).
thf(63,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[8,62,58,40,38,37,12,9]) ).
thf(64,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN983^1 : TPTP v8.1.0. Released v3.6.0.
% 0.07/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jul 12 02:25:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34
% 0.12/0.34 No.of.Axioms: 0
% 0.12/0.34
% 0.12/0.34 Length.of.Defs: 0
% 0.12/0.34
% 0.12/0.34 Contains.Choice.Funs: false
% 0.12/0.34 (rf:0,axioms:0,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:2,loop_count:0,foatp_calls:0,translation:fof_full).
% 0.12/0.39
% 0.12/0.39 ********************************
% 0.12/0.39 * All subproblems solved! *
% 0.12/0.39 ********************************
% 0.12/0.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:63,loop_count:10,foatp_calls:2,translation:fof_full)
% 0.12/0.39
% 0.12/0.39 %**** Beginning of derivation protocol ****
% 0.12/0.39 % SZS output start CNFRefutation
% See solution above
% 0.12/0.39
% 0.12/0.39 %**** End of derivation protocol ****
% 0.12/0.39 %**** no. of clauses in derivation: 36 ****
% 0.12/0.39 %**** clause counter: 63 ****
% 0.12/0.39
% 0.12/0.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:63,loop_count:10,foatp_calls:2,translation:fof_full)
%------------------------------------------------------------------------------